An Intelligent Algorithm for Solving the Efficient Nash Equilibrium of a Single-Leader Multi-Follower Game
نویسندگان
چکیده
This aim of this paper is to provide the immune particle swarm optimization (IPSO) algorithm for solving single-leader–multi-follower game (SLMFG). Through cooperating with (PSO) and an memory mechanism, IPSO designed. Furthermore, we define efficient Nash equilibrium from perspective mathematical economics, which maximizes social welfare further refines number equilibria. In end, numerical experiments show that has fast convergence speed high effectiveness.
منابع مشابه
A decentralized multi-level leader-follower game for network design of a competitive supply chain
This paper develops a decentralized leader-follower game for network design of a competitive supply chain problem in which a new chain as the leader enters a market with one existing supply chain as a follower. Both chains produce an identical product, customer demand is inelastic and customer utility function is based on Huff gravity-based model. The leader wants to shape his network and set a...
متن کاملFinding optimal strategies in a multi-period multi-leader-follower Stackelberg game using an evolutionary algorithm
Stackelberg games are a classic example of bilevel optimization problems, which are often encountered in game theory and economics. These are complex problems with a hierarchical structure, where one optimization task is nested within the other. Despite a number of studies on handling bilevel optimization problems, these problems still remain a challenging territory, and existing methodologies ...
متن کاملSolving multi-leader-common-follower games
Multi-leader-common-follower games arise when modeling two or more competitive firms, the leaders, that commit to their decisions prior to another group of competitive firms, the followers, that react to the decisions made by the leaders. These problems lead in a natural way to equilibrium problems with equilibrium constraints (EPECs). We develop a characterization of the solution sets for thes...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics
سال: 2021
ISSN: ['2227-7390']
DOI: https://doi.org/10.3390/math9050454